Constructing high-fidelity halo merger trees in <scp>abacussummit</scp>
نویسندگان
چکیده
Tracking the formation and evolution of dark matter haloes is a critical aspect any analysis cosmological $N$-body simulations. In particular, mass assembly halo its progenitors, encapsulated in form merger tree, serves as fundamental input for constructing semi-analytic models galaxy and, more generally, building mock catalogues that emulate surveys. We present an algorithm trees from AbacusSummit, largest suite simulations performed to date consisting nearly 60 trillion particles, which has been designed meet Cosmological Simulation Requirements Dark Energy Spectroscopic Instrument (DESI) survey. Our method tracks cores determine associations between objects across multiple timeslices, yielding lists progenitors descendants several tens billions identified entire suite. application these means enhance fidelity AbacusSummit by flagging "merging" deemed exhibit non-monotonic past histories. show this cleaning technique identifies portions population have deblended due choices made finder, but could feasibly part larger aggregate systems. demonstrate post-processing step, we remove potentially unphysical features default catalogues, leaving behind robust can be used create highly-accurate realisations AbacusSummit.
منابع مشابه
Generating Dark Matter Halo Merger Trees
We present a new Monte-Carlo algorithm to generate merger trees describing the formation history of dark matter halos. The algorithm is a modification of the algorithm of Cole et al. (2000) used in the GALFORM semi-analytic galaxy formation model. As such, it is based on the Extended Press-Schechter theory and so should be applicable to hierarchical models with a wide range of power spectra and...
متن کاملConstructing Merger Trees that Mimic N -Body Simulations
We present a simple and efficient empirical algorithm for constructing dark-matter halo merger trees that reproduce the distribution of trees in the Millennium cosmological N body simulation. The generated trees are significantly better than EPS trees. The algorithm is Markovian, and it therefore fails to reproduce the non-Markov features of trees across short time steps, except for an accurate...
متن کاملSupermassive Black Hole Merger Rates: Uncertainties from Halo Merger Theory
The merger of two supermassive black holes is expected to produce a gravitational-wave signal detectable by the satellite LISA. The rate of supermassive-black-hole mergers is intimately connected to the halo merger rate, and the extended Press–Schechter formalism is often employed when calculating the rate at which these events will be observed by LISA. This merger theory is flawed and provides...
متن کاملThe Halo Merger Rate in the Millennium Simulation and Implications for Observed Galaxy Merger Fractions
We have developed a new method to extract halo merger rates from the Millennium Simulation. First, by removing superfluous mergers that are artifacts of the standard Friends-Of-Friends (FOF) halo identification algorithm, we find a lower merger rate compared to previous work. The reductions are more significant at lower redshifts and lower halo masses, and especially for minor mergers. Our new ...
متن کاملConstructing Huffman Trees in Parallel
We present a parallel algorithm for the Huuman Coding problem. We reduce the Huuman Coding problem to the Concave Least Weight Subsequence problem and give a parallel algorithm that solves the latter problem in O(p n log n) time with n processors on a CREW PRAM. This leads to the rst sublinear time o(n 2)-total work parallel algorithm for Huuman Coding. This reduction of the Huuman Coding probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2022
ISSN: ['0035-8711', '1365-8711', '1365-2966']
DOI: https://doi.org/10.1093/mnras/stac555